Minima in Branching Random Walks
نویسنده
چکیده
Given a branching random walk, let Mn be the minimum position of any member of the n’th generation. We calculate EMn to within O(1) and prove exponential tail bounds for P {|Mn − EMn| > x}, under quite general conditions on the branching random walk. In particular, together with work of [8], our results fully characterize the possible behavior of EMn when the branching random walk has bounded branching and step size.
منابع مشابه
Branching Random Walks in Time Inhomogeneous Environments
We study the maximal displacement of branching random walks in a class of time inhomogeneous environments. Specifically, binary branching random walks with Gaussian increments will be considered, where the variances of the increments change over time macroscopically. We find the asymptotics of the maximum up to an OP (1) (stochastically bounded) error, and focus on the following phenomena: the ...
متن کاملBranching Random Walks and Their Applications to Population Studies
Recent investigations have demonstrated that continuous-time branching random walks on multidimensional lattices give an important example of stochastic models in which the evolutionary processes depend on the structure of a medium and the spatial dynamics. It is convenient to describe such processes in terms of birth, death, and walks of particles on the lattice. The structure of a medium is d...
متن کاملPoisson-dirichlet Branching Random Walks
We determine, to within O(1), the expected minimal position at level n in certain branching random walks. The walks under consideration have displacement vector (v1, v2, . . .) where each vj is the sum of j independent Exponential(1) random variables and the different vi need not be independent. In particular, our analysis applies to the Poisson-Dirichlet branching random walk and to the Poisso...
متن کاملBranching random walks in random environment on Cayley graphs
We review some recent results concerning recurrence and transience for branching random walks in random environment on ddimensional lattices and on trees. We obtain some generalizations of these results for the case when the branching random walk in random environment takes place on arbitrary infinite connected Cayley graph.
متن کاملBranching random walks and contact processes on Galton-Watson trees
We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is a Galton-Watson tree then, in certain circumstances, the branching random walks and contact processes will have weak survival phases. We also provide bounds...
متن کامل